Approximating the integral Fréchet distance
نویسندگان
چکیده
منابع مشابه
Approximating the integral Fréchet distance
We present a pseudo-polynomial time (1+ε)-approximation algorithm for computing the integral and average Fréchet distance between two given polygonal curves T1 and T2. The running time is in O(ζ4n4/ε2) where n is the complexity of T1 and T2 and ζ is the maximal ratio of the lengths of any pair of segments from T1 and T2. Furthermore, we give relations between weighted shortest paths inside a si...
متن کاملComputing the Fréchet Gap Distance
Measuring the similarity of two polygonal curves is a fundamental computational task. Among alternatives, the Fréchet distance is one of the most well studied similarity measures. Informally, the Fréchet distance is described as the minimum leash length required for a man on one of the curves to walk a dog on the other curve continuously from the starting to the ending points. In this paper we ...
متن کاملIsotopic Fréchet Distance
We present a variant of the Fréchet distance (as well as geodesic and homotopic Fréchet distance) which forces the motion between the input objects to follow an ambient isotopy. This provides a measure of how much you need to continuously deform one shape into another while maintaining topologically equivalently shapes throughout the deformation.
متن کاملFréchet Distance for Curves, Revisited
We revisit the problem of computing the Fréchet distance between polygonal curves, focusing on the discrete Fréchet distance, where only distance between vertices is considered. We develop efficient approximation algorithms for two natural classes of curves: κ-bounded curves and backbone curves, the latter of which are widely used to model molecular structures. We also propose a pseudo–output-s...
متن کاملFréchet Distance Revisited and Extended
Given two simplicial complexes in IR, and start and end vertices in each complex, we show how to compute curves (in each complex) between these vertices, such that the Fréchet distance between these curves is minimized. As a polygonal curve is a complex, this generalizes the regular notion of weak Fréchet distance between curves. We also generalize the algorithm to handle an input of k simplici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2018
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2018.01.001